Quasi Polymatroidal Flow Networks
نویسندگان
چکیده
In this paper we give a flow model on directed multigraphs by introducing reflexions of generalized polymatroids at vertices as constraints for the flow conservation. This model has the essential features of the classical flow model, primarily the max-flow min-cut theorem and the polynomial algorithm for computing the maximal feasible (integral) flow.
منابع مشابه
Multicommodity Flows in Polymatroidal Capacity Networks
A classical result in undirected edge-capaciated networks is the approximate optimality of routing (flow) for multiple-unicast: the min-cut upper bound is within a logarithmic factor of the number of sources of the max flow [2, 3]. In this paper we focus on extending this result to a more general network model, where there are joint polymatroidal constraints on the rates of the edges that meet ...
متن کاملA note on polylinking flow networks
This is a supplementary note on M. X. Goemans, S. Iwata, and R. Zenklusen’s paper that proposes a flow model based on polylinking systems. Their flow model is a series (or tandem) connection of polylinking systems. We can consider an apparently more general model of a polylinking flow network which consists of an ordinary arccapacitated network endowed with polylinking systems on the vertex set...
متن کاملAspects of Submodularity Workshop Titles and Abstracts Title: Learning Submodular Mixtures; and Active/semi-supervised Learning Joint Work with Title: Multicommodity Flows and Cuts in Polymatroidal Networks
We discuss several recent applications of submodularity to machine learning. First, we present a class of submodular functions useful for document summarization. We show the best ever results on for both generic and query-focused document summarization on widely used and standardized evaluations. We then further improve on these results using a new method to learn submodular mixtures in a large...
متن کاملOn the Vector Linear Solvability of Networks and Discrete Polymatroids
We consider the vector linear solvability of networks over a field Fq. It is well known that a scalar linear solution over Fq exists for a network if and only if the network is matroidal with respect to a matroid representable over Fq. A discrete polymatroid is the multi-set analogue of a matroid. In this paper, a discrete polymatroidal network is defined and it is shown that a vector linear so...
متن کاملPolymatroidal Dependence Structure of a Set of Random Variables
Given a finite set E of r andom variables, the entropy function h on E is a mapp ing f rom the set of all subsets of E into the set of all nonnegative real number s such that for each A C_ E h(A) is the entropy of A. T h e present paper points out that the entropy function h is a fi-function, i.e., a monotone nondecreasing and submodular function with h (~) = 0 and that the pair (E, h) is a pol...
متن کامل